3D SOM Neighborhood Algorithm
نویسندگان
چکیده
Neighborhood algorithm is an important part of 3D SOM algorithm. We proposed three kinds of neighborhood shape and two kinds of neighborhood decay function for threedimensional self-organizing feature maps (3D SOM) algorithm and applied them to three-dimensional image compression coding. Experimental results show that the 3D orthogonal cross neighborhood shape and exponential function algorithm have better peak signal to noise ratio (PSNR) and subject quality than others. Keywords—self-organizing maps; three-dimensional image coding; pattern recognition; neighborhood algorithm
منابع مشابه
The Time Adaptive Self Organizing Map for Distribution Estimation
The feature map represented by the set of weight vectors of the basic SOM (Self-Organizing Map) provides a good approximation to the input space from which the sample vectors come. But the timedecreasing learning rate and neighborhood function of the basic SOM algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changi...
متن کاملGPUMLib: Deep Learning SOM Library for Surface Reconstruction
The evolution of 3D scanning devices and innovation in computer processing power and storage capacity has sparked the revolution of producing big point-cloud datasets. This phenomenon has becoming an integral part of the sophisticated building design process especially in the era of 4 Industrial Revolution. The big point-cloud datasets have caused complexity in handling surface reconstruction a...
متن کاملAuto-SOM: Recursive Parameter Estimation for Guidance of Self-Organizing Feature Maps
An important technique for exploratory data analysis is to form a mapping from the high-dimensional data space to a low-dimensional representation space such that neighborhoods are preserved. A popular method for achieving this is Kohonen's self-organizing map (SOM) algorithm. However, in its original form, this requires the user to choose the values of several parameters heuristically to achie...
متن کاملAsymmetric neighborhood functions accelerate ordering process of self-organizing maps.
A self-organizing map (SOM) algorithm can generate a topographic map from a high-dimensional stimulus space to a low-dimensional array of units. Because a topographic map preserves neighborhood relationships between the stimuli, the SOM can be applied to certain types of information processing such as data visualization. During the learning process, however, topological defects frequently emerg...
متن کاملThe Time Adaptive Self-organizing Map for Distribution Estimation
The feature map represented by the set of weight vectors of the basic SOM (Self-Organizing Map) provides a good approximation to the input space from which the sample vectors come. But the timedecreasing learning rate and neighborhood function of the basic SOM algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changi...
متن کامل